منابع مشابه
Computing finite semigroups
Using a variant of Schreier’s Theorem, and the theory of Green’s relations, we show how to reduce the computation of an arbitrary subsemigroup of a finite regular semigroup to that of certain associated subgroups. Examples of semigroups to which these results apply include many important classes: transformation semigroups, partial permutation semigroups and inverse semigroups, partition monoids...
متن کاملParallel algorithms for computing finite semigroups
In this paper, we present two algorithms based on the Froidure-Pin Algorithm for computing a finite semigroup. If U is any semigroup, and A be a subset of U , then we denote by 〈A〉 the least subsemigroup of U containing A. If B is any other subset of U , then, roughly speaking, the first algorithm we present describes how to use any information about 〈A〉, that has been found using the Froidure-...
متن کاملAUTOMATE, a Computing Package for Automata and Finite Semigroups
AUTOMATE is a package for symbolic computation on nite automata, extended rational expressions and nite semigroups. On the one hand, it enables one to compute the deterministic minimal automaton of the language represented by a rational expression or given by its table. On the other hand, given the transition table of a deterministic automaton, AUTOMATE computes the associated transition monoid...
متن کاملFinite semigroups as categories, ordered semigroups or compact semigroups
The results presented in this section are a good illustration of the following quotation of Marshall Stone [34]: ’A cardinal principle of modern mathematical research may be stated as a maxim: “One must always topologize” ’. Varieties of finite semigroups are a good example where Stone’s principle was applied successfully. Recall that a variety of semigroups is a class of semigroups closed unde...
متن کاملComputing Transformation Semigroups
This paper describes algorithms for computing the structure of finite transformation semigroups. The algorithms depend crucially on a new data structure for an R-class in terms of a group and an action. They provide for local computations, concerning a single R-class, without computing the whole semigroup, as well as for computing the global structure of the semigroup. The algorithms have been ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 2019
ISSN: 0747-7171
DOI: 10.1016/j.jsc.2018.01.002